CS158a Spring 2011Practice Final

To study for the final I would suggest you: (1) Know how to do (by heart) all the practice problems. (2) Go over your notes at least three times. Second and third time try to see how much you can remember from the first time. (3) Go over the homework problems. (4) Try to create your own problems similar to the ones I have given and solve them. (5) Skim the relevant sections from the book. (6) If you want to study in groups, at this point you are ready to quiz each other. The practice final is below. Here are some facts about the actual final: (a) It is comprehensive (b) It is closed book, closed notes. Nothing will be permitted on your desk except your pen (pencil) and test. (c) You should bring photo ID. (d) There will be more than one version of the test. Each version will be of comparable difficulty. (e) It is 10 problems, 6 problems will be on material since the midterm, four problems will come from the topics covered prior to the midterm. (f) Two problems will be exactly (less typos) off of the practice final, and one will be off of practice midterm

1. Give an example of a situation where the count to infinity problem occurs when distance vector routing is used. Explain your example. Show, with this same example, that using split horizon would solve this problem.
2. List the contents of a link state packet. Give an example illustrating how Dijkstra's algorithm works.
3. What is CIDR? How are CIDR network addresses written. Give an example of such an address to specify a network of some size between a class B and class C network.
4. Explain how BGP can detect and prevent loops in route paths. What are some differences between the interior and exterior BGP.
5. Explain how auto-configuration of addresses works in IPv6.
6. What are the roles of the following in PIM-SM? (a) the rendezvous point, (b) a bootstrap router, and (c) a designated router.
7. Briefly explain how connection set-up and tear-down works for TCP. For each, give an example of what happens if one of the messages was lost during the protocol.
8. Give an example of how the silly window syndrome can arise. Show how Nagle's algorithm prevents this situation from occurring.
9. Give an example of how to use iptables or ipfw.
10. Briefly explain with an example the protocol to send a message using SMTP.